Quadratic programming

Variant of linear programming whereby the equations are quadratic rather than linear. The New York Times Financial Glossary

Financial and business terms. 2012.

Look at other dictionaries:

  • Quadratic programming — (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.The quadratic programming problem… …   Wikipedia

  • quadratic programming — Variant of linear programming in which the objective function is quadratic rather than linear. In portfolio selection, we often minimize the variance of the portfolio (which is a quadratic function) subject to constraints on the mean return of… …   Financial and business terms

  • Sequential quadratic programming — (SQP) is one of the most popular and robust algorithms for nonlinear continuous optimization. The method is based on solving a series of subproblems designed to minimize a quadratic model of the objective subject to a linearization of the… …   Wikipedia

  • Quadratic — In mathematics, the term quadratic describes something that pertains to squares, to the operation of squaring, to terms of the second degree, or equations or formulas that involve such terms. Quadratus is Latin for square . Mathematics Algebra… …   Wikipedia

  • Quadratic probing — is a scheme in computer programming for resolving collisions in hash tables.Quadratic probing operates by taking the original hash value and adding successive values of an arbitrary quadratic polynomial to the starting value. This algorithm is… …   Wikipedia

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… …   Wikipedia

  • Nonlinear programming — In mathematics, nonlinear programming (NLP) is the process of solving a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized,… …   Wikipedia

  • Mathematical programming — An operations research technique that solves problems in which an optimal value is sought subject to specified constraints. Mathematical programming models include linear programming, quadratic programming, and dynamic programming. The New York… …   Financial and business terms

  • mathematical programming — An operations research technique that solves problems in which an optimal value is sought subject to specified constraints. Mathematical programming models include linear programming, quadratic programming, and dynamic programming. Bloomberg… …   Financial and business terms

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.